The complexity of updating snapshot objectsATTIYA, Hagit; ELLEN, Faith; FATOUROU, Panagiota et al.Journal of parallel and distributed computing (Print). 2011, Vol 71, Num 12, pp 1570-1577, issn 0743-7315, 8 p.Article

Efficiency of oblivious versus nonoblivious schedulers for optimistic, rate-based flow controlFATOUROU, Panagiota; MAVRONICOLAS, Marios; SPIRAKIS, Paul et al.SIAM journal on computing (Print). 2005, Vol 34, Num 5, pp 1216-1252, issn 0097-5397, 37 p.Article

Time Lower Bounds for Implementations of Multi-Writer SnapshotsELLEN, Faith; FATOUROU, Panagiota; RUPPERT, Eric et al.Journal of the Association for Computing Machinery. 2007, Vol 54, Num 6, issn 0004-5411, 30-30:34Article

The complexity of updating multi-writer snapshot objectsATTIYA, Hagit; ELLEN, Faith; FATOUROU, Panagiota et al.Lecture notes in computer science. 2006, pp 319-330, issn 0302-9743, isbn 978-3-540-68139-7, 1Vol, 12 p.Conference Paper

Single-scanner multi-writer snapshot implementations are fast!FATOUROU, Panagiota; KALLIMANIS, Nikolaos D.ACM Symposium on Principles of Distributed Computing. 2006, pp 228-237, isbn 1-595-93384-0, 1Vol, 10 p.Conference Paper